SVD Algorithms : APEX - like versus
نویسنده
چکیده
We compare several new SVD learning algorithms which are based on the subspace method in principal component analysis with the APEX-like algorithm proposed by Diamantaras. It is shown experimentally that the convergence of these algorithms is as fast as the convergence of the APEX-like algorithm. This paper has not been submitted elsewhere in identical or similar form, nor will it be during the rst three months after its submission to Neural Processing Letters. 2
منابع مشابه
Learning Overcomplete Representations from Distributed Data: A Brief Review
Most of the research on dictionary learning has focused on developing algorithms under the assumption that data is available at a centralized location. But often the data is not available at a centralized location due to practical constraints like data aggregation costs, privacy concerns, etc. Using centralized dictionary learning algorithms may not be the optimal choice in such settings. This ...
متن کاملSpectral Separation of Quantum Dots within Tissue Equivalent Phantom Using Linear Unmixing Methods in Multispectral Fluorescence Reflectance Imaging
Introduction Non-invasive Fluorescent Reflectance Imaging (FRI) is used for accessing physiological and molecular processes in biological media. The aim of this article is to separate the overlapping emission spectra of quantum dots within tissue-equivalent phantom using SVD, Jacobi SVD, and NMF methods in the FRI mode. Materials and Methods In this article, a tissue-like phantom and an optical...
متن کاملTangent Models: Comparing the TD-Neuron Constructive Algorithm versus SVD Based Algorithms
In this paper we present comparative results of our constructive algorithm versus the HSS. Specifically, we tested the HSS algorithm using both the original version based on the two-sided tangent distance, and a new version based on the one-sided tangent distance. Empirical results over the NIST-3 database show that the TD-Neuron is superior to SVD based algorithms since it reaches a better tra...
متن کاملOn Truncated-SVD-like Sparse Solutions to Least-Squares Problems of Arbitrary Dimensions
We describe two algorithms for computing a sparse solution to a least-squares problem where the coefficient matrix can have arbitrary dimensions. We show that the solution vector obtained by our algorithms is close to the solution vector obtained via the truncated SVD approach.
متن کاملRepresentation of Digital Images Using K-SVD Algorithm
In recent years, sparse representation of signal has drawn a great interest. The assumption that natural signals like images admit sparse decomposition over a redundant dictionary leads to efficient algorithms for handling such sources of data. Applications of sparse representation are compression, regularization of inverse problems, feature extraction, noise reduction, pattern classification a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997